#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
char str[maxn];
LL dp[maxn][4];
int main(void){
   	cin.tie(0);std::ios::sync_with_stdio(false);
    LL t;cin>>t;
    while(t--){
        cin>>(str+1);LL n=strlen(str+1);
        for(LL i=1;i<=n+10;i++){
            for(LL j=0;j<3;j++) dp[i][j]=0;
        }
        if(str[1]=='0') dp[1][0]=1;
        if(str[1]=='1') dp[1][1]=1;
        if(str[1]=='?') dp[1][0]=dp[1][1]=1,dp[1][2]=2;
        for(LL i=2;i<=n;i++){
            ///for(LL j=0;j<3;j++) dp[i][j]=dp[i-1][j];

        }
        for(LL i=1;i<=n;i++){
            for(LL j=0;j<3;j++){
                cout<<"dp["<<i<<"]["<<j<<"]="<<dp[i][j]<<" ";
            }
            cout<<"\n";
        }
        if(str[n]=='0'){
            cout<<dp[n][0]<<"\n";
        }
        if(str[n]=='1'){
            cout<<dp[n][1]<<"\n";
        }
        if(str[n]=='?'){
            cout<<dp[n][2]<<"\n";
        }
    }
   	return 0;
}
